Idempotents with polynomial coefficients
نویسنده
چکیده
We combine Young idempotents in the group algebra of the symmetric group with the action of the symmetric group on products of Vandermonde determinants to obtain idempotents with polynomial coefficients.
منابع مشابه
Hyperoctahedral Eulerian Idempotents, Hodge Decompositions, and Signed Graph Coloring Complexes
Phil Hanlon proved that the coefficients of the chromatic polynomial of a graph G are equal (up to sign) to the dimensions of the summands in a Hodge-type decomposition of the top homology of the coloring complex for G. We prove a type B analogue of this result for chromatic polynomials of signed graphs using hyperoctahedral Eulerian idempotents.
متن کاملA rooted-trees q-series lifting a one-parameter family of Lie idempotents
We define and study a series indexed by rooted trees and with coefficients in Q(q). We show that it is related to a family of Lie idempotents. We prove that this series is a q-deformation of a more classical series and that some of its coefficients are Carlitz q-Bernoulli numbers.
متن کاملStochastic averaging for SDEs with Hopf Drift and polynomial diffusion coefficients
It is known that a stochastic differential equation (SDE) induces two probabilistic objects, namely a difusion process and a stochastic flow. While the diffusion process is determined by the innitesimal mean and variance given by the coefficients of the SDE, this is not the case for the stochastic flow induced by the SDE. In order to characterize the stochastic flow uniquely the innitesimal cov...
متن کاملOn Kiselman’s semigroup
We study the algebraic properties of the series Kn of semigroups, which is inspired by [Ki] and has origins in convexity theory. In particular, we describe Green’s relations on Kn, prove that there exists a faithful representation of Kn by n × n matrices with non-negative integer coefficients (and even explicitly construct such a representation), and prove that Kn does not admit a faithful repr...
متن کاملGF(2m) Low-Density Parity-Check Codes Derived from Cyclotomic Cosets
Based on the ideas of cyclotomic cosets, idempotents and Mattson-Solomon polynomials, we present a new method to construct GF(2m ), where m > 0 cyclic low-density paritycheck codes. The construction method produces the dual code idempotent which is used to define the parity-check matrix of the low-density parity-check code. An interesting feature of this construction method is the ability to in...
متن کامل